Approximating a class of superposition processes
نویسندگان
چکیده
منابع مشابه
Approximating persistence in a general class of population processes.
We provide a general framework for estimating persistence in populations which may be affected by catastrophic events, and which are either unbounded or have very large ceilings. We model the population using a birth-death process modified to allow for downward jumps of arbitrary size. For such processes, it is typically necessary to truncate the process in order to make the evaluation of expec...
متن کاملNetwork Class Superposition Analyses
Networks are often used to understand a whole system by modeling the interactions among its pieces. Examples include biomolecules in a cell interacting to provide some primary function, or species in an environment forming a stable community. However, these interactions are often unknown; instead, the pieces' dynamic states are known, and network structure must be inferred. Because observed fun...
متن کاملPoisson superposition processes
Superposition is a mapping on point configurations that sends the n-tuple (x1, . . . , xn) ∈ X into the n-point configuration {x1, . . . , xn} ⊂ X , counted with multiplicity. It is an additive set operation such the superposition of a k-point configuration in X is a kn-point configuration in X . A Poisson superposition process is the superposition in X of a Poisson process in the space of fini...
متن کاملApproximating labelled Markov processes
Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. In this paper, we study approximation techniques for continuous-state labelled Markov processes. We show that the collection of labelled Markov processes carries a Polish-space structure with a countable basis given by finite-state Mar...
متن کاملApproximating Labeled Markov Processes
We study approximate reasoning about continuous-state labeled Markov processes. We show how to approximate a labeled Markov process by a family of finite-state labeled Markov chains. We show that the collection of labeled Markov processes carries a Polish space structure with a countable basis given by finite state Markov chains with rational probabilities. The primary technical tools that we d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1991
ISSN: 0893-9659
DOI: 10.1016/0893-9659(91)90137-k